基于GA-ML-PMHT的多基站无源协同定位方法

针对无源协同定位系统中低可观测目标的航迹初始及维持问题,提出一种基于遗传算法的极大似然概率多假设的多基站无源协同定位方法。首先,建立多基站无源协同定位系统数学模型。其次,提出基于极大似然概率多假设的无源协同定位航迹初始算法,并首次利用遗传算法解决极大似然概率多假设中的优化求解问题,以提高目标检测跟踪性能。最后,通过滑窗法实现航迹维持。仿真结果表明,所提方法能够有效解决多基站无源协同定位系统中低可观测目标的航迹初始及维持问题。     

复杂系统的结构演变

考虑复杂性的一个侧面,从最简单的非线性方程出发,探讨战斗格局的结构演变和国防经费的良性循环,并通过这两个实例,揭示控制参数临界点的研究和度的把握,具有很大的理论意义和广泛的应用前景。     

多假设跟踪技术综述

从工程应用的观点出发,对多假设跟踪技术进行综述。描述了从多假设跟踪的萌芽——多目标跟踪的0-1整数规划法,到多假设跟踪方法的形成;由于假设生成过程是算法复杂性决定性的因素,其中量测个数和航迹合并长度又起关键作用。对该问题进行了重点的回顾;进一步MHT实用化的关键是如何克服算法的复杂性,K-最优假设法为算法应用带来希望。同时,对多假设跟踪其它相关技术的发展也进行了简要叙述。     

Makespan minimization in the two‐machine flowshop batch scheduling problem

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part‐types are to be produced in a flexible manufacturing cell organized into a two‐stage production line. The jobs are processed in batches on the first machine, and the completion time of a job is defined as the completion time of the batch containing it. When processing of all jobs in a batch is completed on the first machine, the whole batch of jobs is transferred intact to the second machine. A constant setup time is incurred whenever a batch is formed on any machine. The tradeoff between the setup times and batch processing times gives rise to the batch composition decision. The problem is to find the optimal batch composition and the optimal schedule of the batches so that the makespan is minimized. The problem is shown to be strongly NP‐hard. We identify some special cases by introducing their corresponding solution methods. Heuristic algorithms are also proposed to derive approximate solutions. We conduct computational experiments to study the effectiveness of the proposed heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 128–144, 2000     

一种新的基于图像复杂度的掩密分析技术

基于掩密图像与原始图像在图像复杂度上的差异,提出了一种新的针对图像LSB嵌入的掩密分析算法,通过分析待检图像在嵌入测试消息前后图像复杂度均值和方差的变化情况,利用Fisher判决准则,从而准确判断图像中是否嵌入了秘密消息.实验结果表明,文章所提算法不仅能准确检测顺序LSB嵌入,并且能估计出嵌入消息的长度,而且能够以98％的准确率检测随机LSB嵌入,同时具有实现简单,运行速度快等优点.     

多窗口谱图分析的低截获概率雷达信号识别

在当前复杂的战场环境中,低截获概率雷达信号因其具有大时宽带宽积、强干扰性能、高分辨率和低截获性特点得到了广泛应用,传统的雷达侦察手段很难对其进行有效识别.在低截获概率雷达典型调制分析的基础之上,研究基于人工智能的雷达信号分类识别方法.从低截获概率雷达信号时频特征入手,提出基于多窗口时频谱图分析方法.该算法采用Hermi...     

Ku波段低噪声放大器的设计

运用ADS仿真设计工具,应用Fujitsu公司的FHX04X管芯,分析设计了一个Ku波段的二级平衡式低噪声放大器,在14 GHz～16 GHz的频率范围内获得了低于2 dB的噪声系数,大于16 dB的增益,同时满足输入输出驻波比小于2,输出1 dB压缩功率点大于8 dBm.并和单端电路形式的设计结果进行了比较.     

精密轴承低噪声润滑脂研究进展

随着社会的发展和科学技术的进步,人们对降低设备噪声的要求越来越高,特别是办公设备、家用电器及某些军事装备在这方面的要求更为突出。使用低噪声润滑脂是降低精密滚动轴承噪声的重要途径。综述了国内外低噪声润滑脂的研究情况,探讨了润滑脂组成、制脂工艺、结构及杂质对轴承振动和噪声的影响,分析了低噪声润滑脂下一步的发展方向。     

Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于改进信息熵的抢修操作过程复杂性测度模型

抢修操作过程复杂性既是抢修人员准确衡量抢修操作难易程度及不确定性的重要指标,又是辅助指挥员进行抢修任务分配及抢修资源调度的重要参考,还是进行抢修时间估计的重要依据。然而,目前没有合适的抢修操作过程复杂性测度方法。考虑到普通信息熵极大值公理与抢修操作过程复杂性的特征不相符,利用改进的信息熵建立抢修操作过程的复杂性测度模型,并利用回归分析法通过实例验证,模型测度结果可以客观地反映抢修操作过程的复杂性。